GPU-based parallel solver via the Kantorovich theorem for the nonlinear Bernstein polynomial systems
نویسندگان
چکیده
This paper proposes a parallel solver for the nonlinear systems in Bernstein form based on subdivision and the Newton-Raphson method, where the Kantorovich theorem is employed to identify the existence of a unique root and guarantee convergence of the Newton-Raphson iterations. Since the Kantorovich theorem accommodates a singular Jacobian at the root, the proposed algorithm performs well in a multiple root case. Moreover, the solver is designed and implemented in parallel on Graphics Processing Unit(GPU) with SIMD architecture; thus, efficiency for solving a large number of systems is improved greatly, an observation validated by our experimental results.
منابع مشابه
Numerical resolution of large deflections in cantilever beams by Bernstein spectral method and a convolution quadrature.
The mathematical modeling of the large deflections for the cantilever beams leads to a nonlinear differential equation with the mixed boundary conditions. Different numerical methods have been implemented by various authors for such problems. In this paper, two novel numerical techniques are investigated for the numerical simulation of the problem. The first is based on a spectral method utiliz...
متن کاملThe Numerical Solution of Some Optimal Control Systems with Constant and Pantograph Delays via Bernstein Polynomials
In this paper, we present a numerical method based on Bernstein polynomials to solve optimal control systems with constant and pantograph delays. Constant or pantograph delays may appear in state-control or both. We derive delay operational matrix and pantograph operational matrix for Bernstein polynomials then, these are utilized to reduce the solution of optimal control with constant...
متن کاملA meshless technique for nonlinear Volterra-Fredholm integral equations via hybrid of radial basis functions
In this paper, an effective technique is proposed to determine thenumerical solution of nonlinear Volterra-Fredholm integralequations (VFIEs) which is based on interpolation by the hybrid ofradial basis functions (RBFs) including both inverse multiquadrics(IMQs), hyperbolic secant (Sechs) and strictly positive definitefunctions. Zeros of the shifted Legendre polynomial are used asthe collocatio...
متن کاملApproximate solution of system of nonlinear Volterra integro-differential equations by using Bernstein collocation method
This paper presents a numerical matrix method based on Bernstein polynomials (BPs) for approximate the solution of a system of m-th order nonlinear Volterra integro-differential equations under initial conditions. The approach is based on operational matrices of BPs. Using the collocation points,this approach reduces the systems of Volterra integro-differential equations associated with the giv...
متن کاملOptimizations for Tensorial Bernstein-Based Solvers by Using Polyhedral Bounds
The tensorial Bernstein basis for multivariate polynomials in n variables has a number 3n of functions for degree 2. Consequently, computing the representation of a multivariate polynomial in the tensorial Bernstein basis is an exponential time algorithm, which makes tensorial Bernstein-based solvers impractical for systems with more than n= 6 or 7 variables. This article describes a polytope (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Mathematics with Applications
دوره 62 شماره
صفحات -
تاریخ انتشار 2011